Implementation Diffie-Hellman by Using Standard Groups and Hosoya-Polynomial to Generate a Matrix as Key Cryptosystem

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

FPGA Implementation DIFFIE-HELLMAN key Exchange Algorithm using DES

Zero-knowledge proof (ZKP) plays an important role in authentication without revealing secret information. Diffie–Hellman (D-H) key exchange algorithm was developed to exchange secret keys through unprotected channels. Previously we have diffiehellmen key exchange algorithm. It has some security attacks like man in the middle attack to overcome this attack by using zero knowledge proof concepts...

متن کامل

Security of polynomial transformations of the Diffie-Hellman key

D. Boneh and R. Venkatesan have recently proposed an approach to proving that a reasonably small portions of most significant bits of the Diffie–Hellman key modulo a prime are as secure the the whole key. Some further improvements and generalizations have been obtained by I. M. Gonzales Vasco and I. E. Shparlinski. E. R. Verheul has obtained certain analogies of these results in the case of Dif...

متن کامل

Diffie-Hellman Key Exchange Protocol, Its Generalization and Nilpotent Groups

Author: Ayan Mahalanobis Title: Diffie-Hellman Key Exchange Protocol, its Generalization and Nilpotent Groups Dissertation Advisor: Dr. Spyros Magliveras Degree: Doctor of Philosophy Year: 2005 This dissertation has two chapters. In the first chapter we talk about the discrete logarithm problem, more specifically we concentrate on the Diffie-Hellman key exchange protocol. We survey the current ...

متن کامل

Diffie-Hellman key exchange protocol and non-abelian nilpotent groups

In this paper we study a key exchange protocol similar to DiffieHellman key exchange protocol using abelian subgroups of the automorphism group of a non-abelian nilpotent group. We also generalize group no.92 of HallSenior table [15], for arbitrary prime p and show that for those groups, the group of central automorphisms commute. We use these for the key exchange we are studying. MSC: 94A62, 2...

متن کامل

Dynamic Group Diffie-Hellman Key Exchange under Standard Assumptions

Authenticated Diffie-Hellman key exchange allows two principals communicating over a public network, and each holding public/private keys, to agree on a shared secret value. In this paper we study the natural extension of this cryptographic problem to a group of principals. We begin from existing formal security models and refine them to incorporate major missing details (e.g., strong-corruptio...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Engineering and Applied Sciences

سال: 2019

ISSN: 1816-949X

DOI: 10.36478/jeasci.2019.3806.3812